Convex isometric folding
نویسندگان
چکیده
منابع مشابه
A Convex Approach for Learning Near-Isometric Linear Embeddings
We propose a novel framework for the deterministic construction of linear, near-isometric embeddings of a finite set of data points. Given a set of training points X ⊂ R , we consider the secant set S(X ) that consists of all pairwise difference vectors of X , normalized to lie on the unit sphere. We formulate an affine rank minimization problem to construct a matrix Ψ that preserves the norms ...
متن کاملConvex and isometric domination of (weak) dominating pair graphs
A set D of vertices in a graph G is a dominating set if every vertex of G, which is not in D, has a neighbor in D. A set of vertices D in G is convex (respectively, isometric), if all vertices in all shortest paths (respectively, all vertices in one of the shortest paths) between any two vertices in D lie in D. The problem of finding a minimum convex dominating (respectively, isometric dominati...
متن کاملFilling a Hole in a Crease Pattern: Isometric Mapping from Prescribed Boundary Folding
Given a sheet of paper and a prescribed folding of its boundary, is there a way to fold the paper’s interior without stretching so that the boundary lines up with the prescribed boundary folding? For polygonal boundaries nonexpansively folded at finitely many points, we prove that a consistent isometric mapping of the polygon interior always exists and is computable in polynomial time.
متن کاملMonocular template-based 3D surface reconstruction: Convex inextensible and nonconvex isometric methods
We study the 3D reconstruction of an isometric surface from point correspondences between a template and a single input image. The template shows the surface flat and fronto-parallel. We propose three new methods. The first two use a convex relaxation of isometry to inextensibility. They are formulated as Second Order Cone Programs (SOCP). The first proposed method is point-wise (it reconstruct...
متن کاملRemarks on Quasi-isometric Non-embeddability into Uniformly Convex Banach Spaces
We construct a locally finite graph and a bounded geometry metric space which do not admit a quasi-isometric embedding into any uniformly convex Banach space. Connections with the geometry of c0 and superreflexivity are discussed. The question of coarse embeddability into uniformly convex Banach spaces became interesting after the recent work of G. Kasparov and G. Yu, who showed the coarse Novi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics and Mathematical Sciences
سال: 2000
ISSN: 0161-1712,1687-0425
DOI: 10.1155/s0161171200001198